Fair Client Puzzles from the Bitcoin Blockchain
نویسندگان
چکیده
Client puzzles have been proposed as a mechanism for proving legitimate intentions by providing “proofs of work”, which can be applied to discourage malicious usage of resources. A typical problem of puzzle constructions is the difference in expected solving time on different computing platforms. We call puzzles which can be solved independently of client computing resources fair client puzzles. We propose a construction for client puzzles requiring widely distributed computational effort for their solution. These puzzles can be solved using the mining process of Bitcoin, or similar cryptocurrencies. Adapting existing definitions, we show that our puzzle construction satisfies formal requirements of client puzzles under reasonable assumptions. We describe a way of transforming our client puzzles for use in denial of service scenarios and demonstrate a practical construction.
منابع مشابه
FruitChains: A Fair Blockchain
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. His ingenious protocol prevents “sybil attacks” (where an adversary spawns any number of new players) by relying on computational puzzles (a.k.a. “moderately hard f...
متن کاملWhen Mobile Blockchain Meets Edge Computing: Challenges and Applications
Blockchain, as the backbone technology of the current popular Bitcoin digital currency, has become a promising decentralized approach for resource and transaction management. Although blockchain has been widely adopted in many applications, e.g., finance, healthcare, and logistics, its application in mobile environments is still limited. This is due to the fact that blockchain users need to sol...
متن کاملRedactable Blockchain - or - Rewriting History in Bitcoin and Friends
We put forward a new framework that makes it possible to re-write or compress the content of any number of blocks in decentralized services exploiting the blockchain technology. As we argue, there are several reasons to prefer an editable blockchain, spanning from the necessity to remove inappropriate content and the possibility to support applications requiring re-writable storage, to “the rig...
متن کاملProposal for a fully decentralized blockchain and proof-of-work algorithm for solving NP-complete problems
We propose a proof-of-work algorithm that rewards blockchain miners for using computational resources to solve NP-complete puzzles. The resulting blockchain will publicly store and improve solutions to problems with real world applications while maintaining a secure and fully functional transaction ledger.
متن کاملTumbleBit: An Untrusted Tumbler for Bitcoin-Compatible Anonymous Payments
This paper presents TumbleBit, a new anonymous payments scheme that is fully compatible with today’s Bitcoin protocol. TumbleBit allows parties to make payments through an untrusted Tumbler. No-one, not even the Tumbler, can tell which payer paid which payee during a TumbleBit epoch. TumbleBit consists of two interleaved fair-exchange protocols that prevent theft of bitcoins by cheating users o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016